Greedy Oriented Flows

Flows in Oriented Matroids

Recently Hochstättler and Nešetřil [3] introduced the flow lattice of an oriented matroid as generalization of the lattice of all integer flows of a digraph or more general a regular matroid. This lattice is defined as the integer hull of the characteristic vectors of signed circuits. We describe the structure and the dimension of the flow lattice for uniform and rank 3 oriented matroids and co...

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

This paper presents a new non-greedy routing and admission control algorithm for the dynamic routing of bandwidth-guaranteed tunnels. The algorithm operates online that is handling requests which arrive one at a time without prior knowledge of the traf®c pattern. It combines the key concepts in the minimum interference routing algorithm and the algorithms developed based on theoretic competitiv...

The Maximum Flow Problem for Oriented Flows

In several applications of network flows, additional constraints have to be considered. In this paper, we study flows, where the flow particles have an orientation. For example, cargo containers with doors only on one side and train coaches with 1st and 2nd class compartments have such an orientation. If the end position has a mandatory orientation, not every path from source to sink is feasibl...

Greedy decomposition integrals

In this contribution we define a new class of non-linear integrals based on decomposition integrals. These integrals are motivated by greediness of many real-life situations. Another view on this new class of integrals is that it is a generalization of both the Shilkret and PAN integrals. Moreover, it can be seen as an iterated Shilkret integral. Also, an example in time-series analysis is prov...

Antisymmetric flows and strong oriented coloring of planar graphs